Comparing type systems for deadlock freedom

Message-passing software systems exhibit non-trivial forms of concurrency and distribution; they are expected to follow intended protocols among communicating services, but also never “get stuck”. This intuitive requirement has been expressed by liveness properties such as progress or (dead)lock freedom various type ensure these for concurrent processes. Unfortunately, very little is known about the precise relationship between classes typed processes induce. paper puts forward first comparative study different message-passing that guarantee deadlock freedom. We compare two deadlock-free processes, here denoted L K. The class stands out its canonicity: it results from Curry-Howard interpretations classical linear logic propositions session types. K, obtained encoding types into Kobayashi's with usages, includes not typable in other systems. show strictly included identify conditions under which coincide. provide type-preserving translations K L.